Multiresolution Matrix Factorization
نویسندگان
چکیده
Large matrices appearing in machine learning problems often have complex hierarchical structures that go beyond what can be found by traditional linear algebra tools, such as eigendecomposition. Inspired by ideas from multiresolution analysis, this paper introduces a new notion of matrix factorization that can capture structure in matrices at multiple different scales. The resulting Multiresolution Matrix Factorizations (MMFs) not only provide a wavelet basis for sparse approximation, but can also be used for matrix compression (similar to Nyström approximations) and as a prior for matrix completion.
منابع مشابه
LU Factorization of Non-standard Forms and Direct Multiresolution Solvers
In this paper we introduce the multiresolution LU factorization of non-standard forms (NS-forms) and develop fast direct multiresolution methods for solving systems of linear algebraic equations arising in elliptic problems. The NS-form has been shown to provide a sparse representation for a wide class of operators, including those arising in strictly elliptic problems. For example, Green’s fun...
متن کاملA Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملParallel MMF: a Multiresolution Approach to Matrix Computation
Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF factorization. Empirically, the running time of pMMF scales linearly in the dimension for sparse matrices. We argue that this makes pMMF a valuable new computational prim...
متن کاملStability and Linear Independence Associated with Scaling Vectors
In this paper, we discuss stability and linear independence of the integer translates of a scaling vector = (1 ; ; r) T , which satisses a matrix reenement equation (x) = n X k=0 P k (2x ? k); where (P k) is a nite matrix sequence. We call P (z) = 1 2 P P k z k the symbol of. Stable scaling vectors often serve as generators of multiresolution analyses (MRA) and therefore play an important role ...
متن کامل